/**
 * Software License, Version 1.0
 * 
 * Copyright 2003 The Trustees of Indiana University.  All rights reserved.
 * 
 *
 *Redistribution and use in source and binary forms, with or without 
 *modification, are permitted provided that the following conditions are met:
 *
 *1) All redistributions of source code must retain the above copyright notice,
 * the list of authors in the original source code, this list of conditions and
 * the disclaimer listed in this license;
 *2) All redistributions in binary form must reproduce the above copyright 
 * notice, this list of conditions and the disclaimer listed in this license in
 * the documentation and/or other materials provided with the distribution;
 *3) Any documentation included with all redistributions must include the 
 * following acknowledgement:
 *
 *"This product includes software developed by the Community Grids Lab. For 
 * further information contact the Community Grids Lab at 
 * http://communitygrids.iu.edu/."
 *
 * Alternatively, this acknowledgement may appear in the software itself, and 
 * wherever such third-party acknowledgments normally appear.
 * 
 *4) The name Indiana University or Community Grids Lab or NaradaBrokering, 
 * shall not be used to endorse or promote products derived from this software 
 * without prior written permission from Indiana University.  For written 
 * permission, please contact the Advanced Research and Technology Institute 
 * ("ARTI") at 351 West 10th Street, Indianapolis, Indiana 46202.
 *5) Products derived from this software may not be called NaradaBrokering, 
 * nor may Indiana University or Community Grids Lab or NaradaBrokering appear
 * in their name, without prior written permission of ARTI.
 * 
 *
 * Indiana University provides no reassurances that the source code provided 
 * does not infringe the patent or any other intellectual property rights of 
 * any other entity.  Indiana University disclaims any liability to any 
 * recipient for claims brought by any other entity based on infringement of 
 * intellectual property rights or otherwise.  
 *
 *LICENSEE UNDERSTANDS THAT SOFTWARE IS PROVIDED "AS IS" FOR WHICH NO 
 *WARRANTIES AS TO CAPABILITIES OR ACCURACY ARE MADE. INDIANA UNIVERSITY GIVES
 *NO WARRANTIES AND MAKES NO REPRESENTATION THAT SOFTWARE IS FREE OF 
 *INFRINGEMENT OF THIRD PARTY PATENT, COPYRIGHT, OR OTHER PROPRIETARY RIGHTS. 
 *INDIANA UNIVERSITY MAKES NO WARRANTIES THAT SOFTWARE IS FREE FROM "BUGS", 
 *"VIRUSES", "TROJAN HORSES", "TRAP DOORS", "WORMS", OR OTHER HARMFUL CODE.  
 *LICENSEE ASSUMES THE ENTIRE RISK AS TO THE PERFORMANCE OF SOFTWARE AND/OR 
 *ASSOCIATED MATERIALS, AND TO THE PERFORMANCE AND VALIDITY OF INFORMATION 
 *GENERATED USING SOFTWARE.
 */
package cgl.narada.service;


public class TaskManager {

  private static long timestamp;
 
  public TaskManager() {
    
  }
  
  public static Task createTask() {
    long taskId = createNewTaskId();
    return new Task(taskId);
  }
  
  
  public static void createSubTasks(Task task, int numOfSubTasks) {
    task.setNumOfSubTasks(numOfSubTasks);
    for (int i=0; i<numOfSubTasks; i++) {
      long taskId = createNewTaskId();
      Task subTask = new Task(taskId);
      task.addSubTask(subTask);
    } 
  }
  
  
  public static void setTaskDescription(Task task, String description) {
    task.setTaskDescription(description); 
  }

  public static void setNumOfWorkUnits(Task task, int numOfWorkUnits) {
    task.setNumOfWorkUnits(numOfWorkUnits);
  }
  
  public static void setNumOfWorkUnitsCompleted(Task task, 
						int numOfWorkUnitsCompleted) {
    task.setNumOfWorkUnitsCompleted(numOfWorkUnitsCompleted);
  }
  
  private static long createNewTaskId() {
    long taskId = 0;
    while (taskId <= timestamp) {
      taskId = System.currentTimeMillis();
    }
    timestamp = taskId;
    return taskId;
  }

  public static void main(String[] args) {
    Task task = TaskManager.createTask();
    TaskManager.setTaskDescription(task, "Tranferring large file ..");
    
    TaskManager.createSubTasks(task, 2);
    
    Task subTask = task.getSubTask(0);
    TaskManager.setTaskDescription(subTask, "Trying to create fragments");
    
    TaskManager.setNumOfWorkUnits(subTask, 3000);
    TaskManager.setNumOfWorkUnitsCompleted(subTask, 200);

    Task subTask2 = task.getSubTask(1);
    TaskManager.setTaskDescription(subTask2, "Reliably publish fragments");
    
    TaskManager.setNumOfWorkUnits(subTask2, 3000);
    TaskManager.setNumOfWorkUnitsCompleted(subTask2, 150);

    System.out.println(subTask);

    System.out.println("\n\n" + task );
    
  }

}
